Robust Index Selection for Stochastic Dynamic Workloads
نویسندگان
چکیده
Abstract Fast query processing is a primary goal of modern database systems. The use indexes crucial to reduce the execution times queries. Hence, it great interest determine an efficient selection for management system (DBMS). However, index problems are highly challenging as cause additional memory consumption and individual benefit influenced by others. In this paper, we consider accounting non-standard features, such (i) multiple potential workloads, (ii) different risk-averse objectives, (iii) multi-index configurations, (iv) reconfiguration costs, (v) anticipation dynamic workload scenarios. For problem extensions, propose specific model formulations, which can be solved efficiently using solver-based solution techniques. applicability performance our concepts demonstrated reproducible synthetic workloads well standard TPC-H TPC-DS-based benchmark workloads.
منابع مشابه
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of representative queries from the original workload. A single pass clustering algorithm with a simple and elegant selectivity based query distance metric guarantees low memory and time complexity. Experiments on two rea...
متن کاملRobust fuzzy CPU utilization control for dynamic workloads
In a number of real-time applications such as target tracking, precise workloads are unknown a priori but may dynamically vary, for example, based on the changing number of targets to track. It is important to manage the CPU utilization, via feedback control, to avoid severe overload or underutilization even in the presence of dynamic workloads. However, it is challenge to model a real-time sys...
متن کاملRUMR: Robust Scheduling for Divisible Workloads
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been proposed to reduce application makespan. Our goal is to develop a practical divisible workload scheduling strategy. This requires that previous work be revisited as several usual assumptions about the computing platform d...
متن کاملStochastic Queuing Simulation for Data Center Workloads
Data center systems and workloads are increasing in importance, yet there are few methods for evaluating potential changes to these systems. We introduce a new methodology for exascale evaluation, called Statistical Queuing Simulation (SQS). At its heart, SQS is a parallel, large-scale stochastic discrete time simulation of generalized queueing models that are driven by empirically-observed arr...
متن کاملRobust Process Control by Dynamic Stochastic Programming
Unnecessarily conservative behavior of standard process control techniques can be avoided by stochastic programming models when the distribution of random distur bances is known. In an earlier study we have investigated such an approach for tank level constraints of a distillation process. Here we address techniques that have accelerated the numerical solution of the large and expensive stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN computer science
سال: 2022
ISSN: ['2661-8907', '2662-995X']
DOI: https://doi.org/10.1007/s42979-022-01473-7